Gentzen-style classical logic as CPS calculus
نویسنده
چکیده
We show that one can encode proof of the Gentzen'sLK as the -terms; and the cut-elimination procedure for LK as -contraction. Precisely, we observe that Strongly Normalizable(SN) and Church-Rosser(CR) cut-elimination procedure for (intuitionistic decoration of) LKQ, as presented in Danos et al.(1993), can be considered as the call-by-value(CBV) Continuation Passing Style(CPS) computation.
منابع مشابه
Gentzen-style Classical Proofs as -terms
We show that the Gentzen-style classical logic LKT, as presented in Danos et al.(1993), can be considered as the classical call-by-name (CBN) calculus. First, we present a new term calculus for LKT which faithfully simulates cut-elimination procedure, namely tq-protocol. Then, we give a translation of Parigot's -calculus. This translation can be seen as the classical extension to the Plotkin's ...
متن کاملClassical Proofs as Programs, Cut Elimination as Computation
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as presented in Danos et al.(1994), is isomorphic to call-by-name (CBN) and call-by-value (CBV) reduction system respectively. Our method is simple. We assign typed -terms on intuitionistic decoration of LKT/LKQ so as to simulate the cut-elimination procedure by -contraction | i.e. we simulate cutelim...
متن کاملA proof theoretical approach to Continuation Passing Style
In this paper we study the relation with continuation passing style(CPS) and classical proofs, proof theoretically. There is two style of CPS translation { Call by name (CBN) and Call by value(CBV). We revealed that in the case of classical proofs, this two reduction strategy may induce di erent result even if the language is purely functional(i.e. proof theoretical). We explain this through th...
متن کاملConstructive Classical Logic as CPS-Calculus
We establish the Curry-Howard isomorphism between constructive classical logic and CPS-calculus. CPS-calculus exactly means the target language of Continuation Passing Style(CPS) transforms. Constructive classical logic we refer to are LKT and LKQ introduced by Danos et al.(1993).
متن کاملCPS-calculus in Various Style
Continuation Passing Style (CPS) is widely used in the semantics of functional programming languages. We emphasize that CPS translates calculus with control operators into a very basic calculus | CPS calculus. In the past literature, CPS calculus appears in various style in di erent situation. We show how they can be considered as the "same" calculus. More precisely, all of them are Curry-Howar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007